Dimension-Independent BSP (1): Section and interior-to-boundary Mapping

In this paper we discuss an algorithm to perform the conversion from the interior to the boundary of d-dimensional polyhedra, where both the d-polyhedron and its (d 1) boundary faces are represented as BSP trees. This approach allows also to compute the BSP tree of the set intersection between any hyperplane in Ed and the BSP representation of a d-polyhedron. If such section hyperplane is the a ne support of a (d 1)-face, then a BSP tree of the face is generated. The algorithm may be iteratively applied to compute the k-skeletons of a d-polyhedron. ii